package com.hiwhitley.easy.day05;

/**
 * Created by hiwhitley on 2016/8/5.
 */
public class Solution5 {
    public int minNumberInRotateArray(int[] array) {
        if (array.length == 0)
            return 0;
        for (int i = 0; i < array.length; i++) {
            if (array[i + 1] < array[i]) {
                return array[i + 1];
            }
        }
        return 0;
    }
}
